Parallelizing multidimensional indexes for main memory databases
نویسندگان
چکیده
Parallelizing multidimensional indexes for main memory databases Master thesis,
منابع مشابه
Parallel Execution of kNN-Queries on in-memory K-D Trees
Parallel algorithms for main memory databases become an increasingly interesting topic as the amount of main memory and the number of CPU cores in computer systems increase. This paper suggests a method for parallelizing the k-d tree and its kNN search algorithm as well as suggesting optimizations. In empirical tests, the resulting modified k-d tree outperforms both the k-d tree and a paralleli...
متن کاملPack Indexing for Time-Constrained In-Memory Query Processing
Main memory databases management systems are used more often and in a wide spread of application scenarios. To take significant advantage of the main memory read performance, most techniques known from traditional disk-centric database systems have to be adapted and re-designed. In the field of indexing, many mainmemory-optimized index structures have been proposed. Most of these works aim at p...
متن کاملEfficient Bulk Operations on Dynamic R-Trees1
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidimensional spatial indexes (data structures). Construction of spatial indexes (bulk loading) has been studied intensively in the database community. The continuous arrival of massive amounts of new data makes it import...
متن کاملThe UB - Tree : Performance of Multidimensional Range
We investigate the usability and performance of the UB-Tree (universal B-Tree) for multidimensional data, as they arise in all relational databases and in particular in datawarehousing and data-mining applications. The UB-Tree is balanced and has all the guaranteed performance characteristics of B-Trees, i.e., it requires linear space for storage and logarithmic time for the basic operations of...
متن کاملThe UB - Tree : Performance of Multidimensional Range Queries
We investigate the usability and performance of the UB-Tree (universal B-Tree) for multidimensional data, as they arise in all relational databases and in particular in datawarehousing and data-mining applications. The UB-Tree is balanced and has all the guaranteed performance characteristics of B-Trees, i.e., it requires linear space for storage and logarithmic time for the basic operations of...
متن کامل